Online makespan scheduling with job migration on uniform machines

In the classic minimum makespan scheduling problem, we are given an input sequence of n jobs with sizes. A scheduling algorithm has to assign the jobs to m parallel machines. The objective is to minimize the makespan, which is the time it takes until all jobs are processed. In this paper, we consider online scheduling algorithms without preemption. However, we allow the online algorithm to reassign up to k jobs to different machines in the final assignment. For m identical machines, Albers and Hellwig (Algorithmica, 2017) give tight bounds on the competitive ratio in this model. The precise ratio depends on, and increases with, m. It lies between 4/3 and ~~ 1.4659. They show that k = O(m) is sufficient to achieve this bound and no k = o(n) can result in a better bound. We study m uniform machines, i.e., machines with different speeds, and show that this setting is strictly harder. For sufficiently large m, there is a delta = Theta(1) such that, for m machines with only two different machine speeds, no online algorithm can achieve a competitive ratio of less than 1.4659 + delta with k = o(n). We present a new algorithm for the uniform machine setting. Depending on the speeds of the machines, our scheduling algorithm achieves a competitive ratio that lies between 4/3 and ~~ 1.7992 with k = O(m). We also show that k = Omega(m) is necessary to achieve a competitive ratio below 2. Our algorithm is based on a subtle imbalance with respect to the completion times of the machines, complemented by a bicriteria approximation algorithm that minimizes the makespan and maximizes the average completion time for certain sets of machines

Online packet scheduling for CIOQ and buffered crossbar switches

We consider the problem of online packet scheduling in Combined Input and Output Queued (CIOQ) and buffered crossbar switches. In the widely used CIOQ switches, packet buffers (queues) are placed at both input and output ports. An N×N CIOQ switch has N input ports and N output ports, where each input port is equipped with N queues, each of which corresponds to an output port, and each output port is equipped with only one queue. In each time slot, arbitrarily many packets may arrive at each input port, and only one packet can be transmitted from each output port. Packets are transferred from the queues of input ports to the queues of output ports through the internal fabric. Buffered crossbar switches follow a similar design, but are equipped with additional buffers in their internal fabric. In either model, our goal is to maximize the number or, in case the packets have weights, the total weight of transmitted packets. Our main objective is to devise online algorithms that are both competitive and efficient. We improve the previously known results for both switch models, both for unweighted and weighted packets. For unweighted packets, Kesselman and Rosén (J. Algorithms 60(1):60–83, 2006) give an online algorithm that is 3-competitive for CIOQ switches. We give a faster, more practical algorithm achieving the same competitive ratio. In the buffered crossbar model, we also show 3-competitiveness, improving the previously known ratio of 4. For weighted packets, we give 5.83- and 14.83-competitive algorithms with an elegant analysis for CIOQ and buffered crossbar switches, respectively. This improves upon the previously known ratios of 6 and 16.24

Comparison-based FIFO buffer management in QoS switches

The following online problem arises in network devices, e.g., switches, with quality of service (QoS) guarantees. In each time step, an arbitrary number of packets arrive at a single FIFO buffer and only one packet can be transmitted. Packets may be kept in the buffer of limited size and, due to the FIFO property, the sequence of transmitted packets has to be a subsequence of the arriving packets. The differentiated service concept is implemented by attributing each packet with a non-negative value corresponding to its service level. A buffer management algorithm can reject arriving packets and preempt buffered packets. The goal is to maximize the total value of transmitted packets. We study comparison-based buffer management algorithms, i.e., algorithms that make their decisions based solely on the relative order between packet values with no regard to the actual values. This kind of algorithms proves to be robust in the realm of QoS switches. Kesselman et al. (SIAM J. Comput., 2004) present a comparison-based algorithm that is 2-competitive. For a long time, it has been an open problem whether a comparison-based algorithm exists with a competitive ratio below 2. We present a lower bound of 1 + 1/√2 ≈ 1.707 on the competitive ratio of any deterministic comparison-based algorithm and give an algorithm that matches this lower bound in the case of monotonic sequences, i.e., packets arrive in a non-decreasing order according to their values

Online makespan scheduling with job migration on uniform machines

In the classic minimum makespan scheduling problem, we are given an input sequence of n jobs with sizes. A scheduling algorithm has to assign the jobs to m parallel machines. The objective is to minimize the makespan, which is the time it takes until all jobs are processed. In this paper, we consider online scheduling algorithms without preemption. However, we allow the online algorithm to change the assignment of up to k jobs at the end for some limited number k. For m identical machines, Albers and Hellwig (Algorithmica 79(2):598–623, 2017) give tight bounds on the competitive ratio in this model. The precise ratio depends on, and increases with, m. It lies between 4/3 and ≈1.4659. They show that k=O(m) is sufficient to achieve this bound and no k=o(n) can result in a better bound. We study m uniform machines, i.e., machines with different speeds, and show that this setting is strictly harder. For sufficiently large m, there is a δ=Θ(1) such that, for m machines with only two different machine speeds, no online algorithm can achieve a competitive ratio of less than 1.4659+δ with k=o(n). We present a new algorithm for the uniform machine setting. Depending on the speeds of the machines, our scheduling algorithm achieves a competitive ratio that lies between 4/3 and ≈1.7992 with k=O(m). We also show that k=Ω(m) is necessary to achieve a competitive ratio below 2. Our algorithm is based on maintaining a specific imbalance with respect to the completion times of the machines, complemented by a bicriteria approximation algorithm that minimizes the makespan and maximizes the average completion time for certain sets of machines

Protective Function of STAT3 in CVB3-Induced Myocarditis

The transcription factor signal transducer and activator of transcription 3 (STAT3) is an important mediator of the inflammatory process. We investigated the role of STAT3 in viral myocarditis and its possible role in the development to dilated cardiomyopathy. We used STAT3-deficent mice with a cardiomyocyte-restricted knockout and induced a viral myocarditis using Coxsackievirus B3 (CVB3) which induced a severe inflammation during the acute phase of the viral myocarditis. A complete virus clearance and an attenuated inflammation were examined in both groups WT and STAT3 KO mice 4 weeks after infection, but the cardiac function in STAT3 KO mice was significantly decreased in contrast to the infected WT mice. Interestingly, an increased expression of collagen I was detected in STAT3 KO mice compared to WT mice 4 weeks after CVB3 infection. Furthermore, the matrix degradation was reduced in STAT3 KO mice which might be an explanation for the observed matrix deposition. Consequently, we here demonstrate the protective function of STAT3 in CVB3-induced myocarditis. Since the cardiomyocyte-restricted knockout leads to an increased fibrosis, it can be assumed that STAT3 signalling in cardiomyocytes protects the heart against increased fibrosis through paracrine effects

Distinct transcriptional MYCN/c-MYC activities are associated with spontaneous regression or malignant progression in neuroblastomas

Differences in MYCN/c-MYC target gene expression are associated with distinct neuroblastoma subtypes and clinical outcome

A database of whole-body action videos for the study of action, emotion, and untrustworthiness

We present a database of high-definition (HD) videos for the study of traits inferred from whole-body actions. Twenty-nine actors (19 female) were filmed performing different actions—walking, picking up a box, putting down a box, jumping, sitting down, and standing and acting—while conveying different traits, including four emotions (anger, fear, happiness, sadness), untrustworthiness, and neutral, where no specific trait was conveyed. For the actions conveying the four emotions and untrustworthiness, the actions were filmed multiple times, with the actor conveying the traits with different levels of intensity. In total, we made 2,783 action videos (in both two-dimensional and three-dimensional format), each lasting 7 s with a frame rate of 50 fps. All videos were filmed in a green-screen studio in order to isolate the action information from all contextual detail and to provide a flexible stimulus set for future use. In order to validate the traits conveyed by each action, we asked participants to rate each of the actions corresponding to the trait that the actor portrayed in the two-dimensional videos. To provide a useful database of stimuli of multiple actions conveying multiple traits, each video name contains information on the gender of the actor, the action executed, the trait conveyed, and the rating of its perceived intensity. All videos can be downloaded free at the following address: http://www-users.york.ac.uk/~neb506/databases.html. We discuss potential uses for the database in the analysis of the perception of whole-body actions

Remote sensing of drained thermokarst lake basin successions

Thermokarst lakes are important factors for permafrost landscape dynamics and carbon cycling. Thermokarst lake cover is particularly high in Arctic lowlands with ice-rich permafrost. In many of these vast lowland regions, drained thermokarst lake basins of different age have been identified that overlap each other in space, suggesting intense dynamics of repeated lake formation and loss with complex carbon cycle histories during the Holocene [Grosse et al.,2013]. Observing the permafrost and ecosystem succession patterns following thermokarst lake drainage will help to better determining the landscape and regional scale impacts of lake loss on northern hydrology, permafrost aggradation, vegetation succession, carbon cycling, as well as spectral land surface property changes. Previous remote sensing approaches to study drained thermokarst lake basins used a combination of Landsat, high resolution satellite and aerial, and field data to quantify carbon stocks accumulated in post-drainage peat in drained thermokarst lake basins (DTLBs) for the northern Seward Peninsula in Northwest Alaska [Jones et al., 2012]. We here expand on this method by using different remote sensing products in combination with dating of lake drainage events. These events are identified based on the historical remote sensing record and accelerated mass spectrometry radiocarbon dating. The joint us of remote sensing and geochronological field data allows to assess the specific succession patterns of various DTLB types and their impacts on land surface properties in different Arctic permafrost regions (North Alaska, Northwest Alaska, North Siberia). The datasets used in this analysis include a range of remote sensing and topographic data, such as aerial photography, historic topographic maps, high resolution satellite images (Corona, Spot, Ikonos, Quickbird, Worldview, GeoEye), and imagery from the full Landsat archive as well as from the Moderate Resolution Imaging Spectrometer (MODIS) sensors. We report temporal trends of spectral properties based on Landsat multispectral indices for individual DTLBs of different ages, but also employ landscape-scale chronosequences allowing the analysis succession trajectories of DTLBs that drained well before the start of the remote sensing record. Here we are particularly focusing on the long-term impacts of lake drainage on changes in normalized difference vegetation index (NDVI), normalized difference moisture index (NDMI), normalized difference water index (NDWI), Tasseled Cap index (brightness, greenness, wetness), land surface temperatures, and albedo. We further conducted field studies including reconnaissance flights targeting historically drained lakes and cored DTLBs to sample for radiocarbon-dating of terrestrial peat layers indicative of the drainage event. Results of this ongoing study suggest a strong impact exerted by thermokarst lake drainage on land surface reflectance characteristics in thermokarst lowland regions. The information may be useful for parameterizing surface properties in land surface models of thermokarst-affected regions, particularly where increased lake drainage is projected to take place